Deterministic two-way one-head pushdown automata are very powerful
نویسندگان
چکیده
منابع مشابه
Simulation of Two-Way Pushdown Automata Revisited
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook’s in...
متن کاملHeight-Deterministic Pushdown Automata
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such lan...
متن کاملDeterministic Frequency Pushdown Automata
A set L is (m,n)-computable iff there is a mechanism which on input of n different words produces n conjectures whether these words are in L, respectively, such that at least m of these conjectures are right. Prior studies dealt with (m,n)computable sets in the contexts of recursion theory, complexity theory and the theory of finite automata. The present work aims to do this with respect to com...
متن کاملThe Reduction of Two-Way Automata to One-Way Automata
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.
متن کاملDescriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals
Two-way nondeterministic pushdown automata (2PDA) are classical nondeterministic pushdown automata (PDA) enhanced with two-way motion of the input head. In this paper, the subclass of 2PDA accepting bounded languages and making at most a constant number of input head turns is studied with respect to descriptional complexity aspects. In particular, the effect of reducing the number of pushdown r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1984
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90001-2